Algorithms Unplugged
- Type:
- Other > E-books
- Files:
- 1
- Size:
- 10.76 MB
- Texted language(s):
- English
- Tag(s):
- Algorithms Unplugged Algorithms Unplugged Algorithms Unplugged Torrent Springer Algorithms Unplugged PDF PDF Algorithms Unplugged 2011 2011 AmitVerma Book eBook Berthold Vocking Helmut Alt Martin Diet
- Quality:
- +3 / -0 (+3)
- Uploaded:
- Aug 27, 2011
- By:
- amitverma
Algorithms Unplugged Author: Berthold Vocking, Helmut Alt, Martin Dietzfelbinger, Rudiger Reischuk, Christian Scheideler, Heribert Vollmer, Dorothea Wagner ISBN 978-3-642-15327-3 e-ISBN 978-3-642-15328-0 Format: PDF Page: 417 Publisher: Springer Pub. Date: 2011 ::Description:: Part I Searching and Sorting Overview Martin Dietzfelbinger and Christian Scheideler . . . . 3 1 Binary Search Thomas Seidl and Jost Enderle . . . . 5 2 Insertion Sort Wolfgang P. Kowalk .. . . . . 13 3 Fast Sorting Algorithms Helmut Alt . . . . 17 4 Parallel Sorting - The Need for Speed Rolf Wanka . . . . 27 5 Topological Sorting - How Should I Begin to Complete My To Do List? Hagen Hopfner . . . . . 39 6 Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm Markus E. Nebel . . . . . . . . . . 47 7 Depth-First Search (Ariadne&Co.) Michael Dom, Falk H¨uffner, and Rolf Niedermeier . . . . . . 57 8 Pledge’s Algorithm Rolf Klein and Tom Kamphans . . . . . . . . . . . . . . . . 69 9 Cycles in Graphs Holger Schlingloff . . . . . . . . . . . . . . . . . . 77 10 PageRank - What Is Really Relevant in the World-Wide Web? Ulrik Brandes and Gabi Dorfm¨uller . . . . . . . . . . . . . . . 89 Part II Arithmetic and Encryption Overview Berthold V¨ocking . . . . . . . . . . . 99 11 Multiplication of Long Integers - Faster than Long Multiplication Arno Eigenwillig and Kurt Mehlhorn . . . . . . . . 101 12 The Euclidean Algorithm Friedrich Eisenbrand . . . . . . . . . 111 13 The Sieve of Eratosthenes - How Fast Can We Compute a Prime Number Table? Rolf H. M¨ohring and Martin Oellrich . . . . . . . . . . . 119 14 One-Way Functions. Mind the Trap - Escape Only for the Initiated R¨udiger Reischuk and Markus Hinkelmann . . . . . . . . . . 131 15 The One-Time Pad Algorithm - The Simplest and Most Secure Way to Keep Secrets Till Tantau . . . . . . . . . . . . 141 16 Public-Key Cryptography Dirk Bongartz and Walter Unger. . . . . . . . 147 17 How to Share a Secret Johannes Bl¨omer . . . . . . . . . . . . 159 18 Playing Poker by Email Detlef Sieling . . . . . . . . . . . 169 19 Fingerprinting Martin Dietzfelbinger . . . . . . . . 181 20 Hashing Christian Schindelhauer . . . . . . . 195 21 Codes - Protecting Data Against Errors and Loss Michael Mitzenmacher . . . . . . . . . 203 Part III Planning, Coordination and Simulation Overview Helmut Alt and R¨udiger Reischuk . . . . . 221 22 Broadcasting - How Can I Quickly Disseminate Information? Christian Scheideler . . . . . . . . . 223 23 Converting Numbers into English Words Lothar Schmitz . . . . . . . . 231 24 Majority - Who Gets Elected Class Rep? Thomas Erlebach . . . . . . . 239 25 Random Numbers - How Can We Create Randomness in Computers? Bruno M¨uller-Clostermann and Tim Jonischkat . . . . . 249 26 Winning Strategies for a Matchstick Game Jochen K¨onemann . . . . . . . . . 259 27 Scheduling of Tournaments or Sports Leagues Sigrid Knust . . . . . . . . . . . 267 28 Eulerian Circuits Michael Behrisch, Amin Coja-Oghlan, and Peter Liske . . . 277 29 High-Speed Circles Dominik Sibbing and Leif Kobbelt . . . 285 30 Gauß-Seidel Iterative Method for the Computation of Physical Problems Christoph Freundl and Ulrich R¨ude . . . . . 295 31 Dynamic Programming - Evolutionary Distance Norbert Blum and Matthias Kretschmer . . . . . . . 305 Part IV Optimization Overview Heribert Vollmer and Dorothea Wagner . . . 315 32 Shortest Paths Peter Sanders and Johannes Singler . . . . 317 33 Minimum Spanning Trees (Sometimes Greed Pays Off . . . ) Katharina Skutella and Martin Skutella . . . . 325 34 Maximum Flows - Towards the Stadium During Rush Hour Robert G¨orke, Steffen Mecke, and Dorothea Wagner . . . 333 35 Marriage Broker Volker Claus, Volker Diekert and Holger Petersen . . . . . . 345 36 The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland? Emo Welzl . . . . . . 357 37 Online Algorithms - What Is It Worth to Know the Future? Susanne Albers and Swen Schmelzer . . . . . . . . . . . 361 38 Bin Packing or "How Do I Get My Stuff into the Boxes?" Joachim Gehweiler and Friedhelm Meyer auf der Heide . . . . . . . . 367 39 The Knapsack Problem Rene Beier and Berthold V¨ocking . . . . . . . . 375 40 The Travelling Salesman Problem Stefan N¨aher . . . . . . . . . . 383 41 Simulated Annealing Peter Rossmanith . . . . . . . 393 Author Details . . . . . 401 ################################################################################## My other torrents can be found here - http://thepiratebay.ee/user/amitverma Happy Reading Amit Verma ##################################################################################
Excellent book!
There are many books on algorithms but most are very dry and boring. Not this one! Good illustrations and very clear exposition. Recommended for anyone interested in the subject.
Thanks for sharing!
There are many books on algorithms but most are very dry and boring. Not this one! Good illustrations and very clear exposition. Recommended for anyone interested in the subject.
Thanks for sharing!
Thank you!
Comments